Orthogonal Discriminant Sparse Maximum Margin Analysis
نویسندگان
چکیده
منابع مشابه
Maximum Margin Discriminant Analysis based Face Recognition
Face recognition is a highly non-trivial classification problem since the input is high-dimensional and there are many classes with just a few examples per class. In this paper we propose using a recent algorithm – Maximum Margin Discriminant Analysis (MMDA) – to solve face recognition problems. MMDA is a feature extraction method that is derived from a set of sound principles: (i) each feature...
متن کاملMaximum Neighborhood Margin Discriminant Projection for Classification
We develop a novel maximum neighborhood margin discriminant projection (MNMDP) technique for dimensionality reduction of high-dimensional data. It utilizes both the local information and class information to model the intraclass and interclass neighborhood scatters. By maximizing the margin between intraclass and interclass neighborhoods of all points, MNMDP cannot only detect the true intrinsi...
متن کاملMargin Maximizing Discriminant Analysis
We propose a new feature extraction method called Margin Maximizing Discriminant Analysis (MMDA) which seeks to extract features suitable for classification tasks. MMDA is based on the principle that an ideal feature should convey the maximum information about the class labels and it should depend only on the geometry of the optimal decision boundary and not on those parts of the distribution o...
متن کاملOrthogonal Maximum Margin Projection for Face Recognition
Dimensionality reduction techniques that can introduce low-dimensional feature representation with enhanced discriminatory power are of paramount importance in face recognition. In this paper, a novel subspace learning algorithm called orthogonal maximum margin projection(OMMP) is proposed. The OMMP algorithm is based on the maximum margin projection (MMP), which aims at discovering both geomet...
متن کاملSparse Learning via Maximum Margin Matrix Factorization
In this paper, an algorithm for sparse learning via Maximum Margin Matrix Factorization(MMMF) is proposed. The algorithm is based on L1 penality and Alternating Direction Method of Multipliers. It shows that with sparse factors, sparse factors method can obtain result as good as dense factors.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: DEStech Transactions on Engineering and Technology Research
سال: 2017
ISSN: 2475-885X
DOI: 10.12783/dtetr/apetc2017/10909